Ergodicity of a polling network with an infinite number of stations

A Markov polling system with infinitely many stations is studied. The topic is the ergodicity of the infinite-dimensional process of queue lengths. For the infinite-dimensional process, the usual type of ergodicity cannot prevail in general and we introduce a modified concept of ergodicity, namely, weak ergodicity. It means the convergence of finitedimensional distributions of the process. We give necessary and sufficient conditions for weak ergodicity. Also, the “usual” ergodicity of the system is studied, as well as convergence of functionals which are continuous in some norm.